A Necessary and Sufficient Condition for Consensus Over Random Networks
نویسندگان
چکیده
منابع مشابه
A combinatorial necessary and sufficient condition for cluster consensus
In this technical note, cluster consensus of discretetime linear multi-agent systems is investigated. A set of stochastic matrices P is said to be a cluster consensus set if the system achieves cluster consensus for any initial state and any sequence of matrices taken from P . By introducing a cluster ergodicity coefficient, we present an equivalence relation between a range of characterization...
متن کاملA Necessary and Sufficient Condition for Transcendency
As has been known for many years (see, e.g., K. Mahler, /. Reine Angew. Math., v. 166, 1932, pp. 118-150), a real or complex number f is transcendental if and only if the following condition is satisfied. To every positive number co there exists a positive integer n and an infinite sequence of distinct polynomials {p,(z)} = {pr + pr z + • • • + p z } at most of 0 1 n degree n with integral coef...
متن کاملA Necessary and Sufficient Condition for Peace∗
This paper examines the possibility for two contestants to agree on a peace settlement thereby avoiding a contest, in which each would exert a costly effort given the posterior distributions inferred from the negotiation. I find a necessary and sufficient condition of the prior distributions for there to exist a negotiation mechanism that admits a peace-ensuring perfect Bayesian equilibrium. Th...
متن کاملOn Consensus Over Random Networks
We consider the decentralized consensus problem over random information networks. In such networks, the underlying graph of the network at a given time instance is random but independent of all other times. For such a framework, we present a simple necessary and sufficient criteria for asymptotic consensus using simple ergodicity and probabilistic arguments. Finally, we investigate a special ca...
متن کاملA Necessary and Sufficient Condition for Partition Testing to be Better Than Random Testing
A necessary a n d sufficient condition is given for par t i t ion testing to be better t h a n random testing. I . INTRODUCTION Partition testing is an approach to program testing in which the input domain of the program is divided into partitions and test cases are selected from these partitions. A number of papers have attempted to clarify the relation between the performance of these two tes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2008
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2008.917743